Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
241	A Casual Tour Around a Circuit Complexity Bound∗ arXiv:1111.1261v1 [cs.CC] 4 Nov 2011 Ryan Williams† Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-11-07 20:15:16 Complexity classes NTIME Circuit complexity P Bounded-error probabilistic polynomial Cook–Levin theorem Time hierarchy theorem NEXPTIME Time complexity Theoretical computer science Computational complexity theory Applied mathematics
242	CCCG 2011, Toronto ON, August 10–12, 2011 Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences Mustafa Mohamad Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Combinatorial optimization Matching Analysis of algorithms Operations research Dynamic programming Optimal control Hungarian algorithm Algorithm Time complexity Theoretical computer science Mathematics Applied mathematics
243	CCCG 2006, Kingston, Ontario, August 14–16, 2006 On Bipartite Matching under the RMS Distance Pankaj K. Agarwal∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:59:06 Analysis of algorithms Computational complexity theory Time complexity Ordinal number Matching Euclidean algorithm Symbol Theoretical computer science Applied mathematics Mathematics
244	LNCSA Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:26:19 Analysis of algorithms NP-complete problems Parameterized complexity Kernelization Dominating set Time complexity Algorithm Mathematical optimization NP Theoretical computer science Computational complexity theory Applied mathematics
245	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:29:26 NP-complete problems Spanning tree Steiner tree problem Minimum spanning tree Time complexity Approximation algorithm Rectilinear Steiner tree Theoretical computer science Graph theory Computational complexity theory
246	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Privacy by Fake Data: A Geometric Approach Victor Alvarez∗ Erin Chambers† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Complexity classes Structural complexity theory Mathematical optimization Approximation algorithms Ε-net NP Polynomial-time approximation scheme Reduction Packing problem Theoretical computer science Computational complexity theory Applied mathematics
247	Contention Resolution with Heterogeneous Job Sizes Michael A. Bender1 , Jeremy T. Fineman2 , and Seth Gilbert2 1 2 Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2007-09-28 06:20:20 Analysis of algorithms Operations research Computational complexity theory Ethernet Exponential backoff Search algorithms Job shop scheduling Binary logarithm Time complexity Theoretical computer science Mathematics Applied mathematics
248	Exploiting symmetries in logistics distribution planning Add to Reading List Source URL: www.mssanz.org.au Language: English - Date: 2013-01-15 22:34:44 NP-complete problems Analysis of algorithms Algorithm Mathematical logic Travelling salesman problem Logistics Symmetry in mathematics Time complexity Vehicle routing problem Theoretical computer science Computational complexity theory Applied mathematics
249	zn poly: a library for polynomial arithmetic David Harvey, New York University January 8, 2009 David Harvey, New York University Add to Reading List Source URL: web.maths.unsw.edu.au Language: English - Date: 2011-07-17 23:06:27 Polynomials Computational number theory Computational complexity theory Algebra Digital signal processing Fast Fourier transform Fast Library for Number Theory Time complexity Multiplication Mathematics Abstract algebra Theoretical computer science
250	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 1, MayWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:15:19 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Feedback vertex set Graph coloring Vertex cover Dominating set Time complexity Theoretical computer science Computational complexity theory Applied mathematics

UPDATE